A Self-assembly Model of Time-Dependent Glue Strength
نویسندگان
چکیده
We propose a reversible self-assembly model in which the glue strength between two juxtaposed tiles is a function of the time they have been in neighboring positions. We then present an implementation of our model using strand displacement reactions on DNA tiles. Under our model, we can for the first time demonstrate and study catalysis and self-replication in the tile assembly rigorously. We then study the tile-complexity for assembling various shapes in our model. We show that using types of tiles, we can assemble thin rectangles of size . We also show a ! lower bound for tile-complexity of a square of size " # with a hole of size $ % in Tile Assembly Model [26], and an upper bound of & for the same shape in our model.
منابع مشابه
Fuel Efficient Computation in Passive Self-Assembly
In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which particles are modeled by four-sided squares with glue types assigned to each tile edge. The assembly process is driven by positive and negative force interactions...
متن کاملCombinatorial Optimization and Verification in Self-Assembly
Two of the most studied tile self-assembly models in the literature are the abstract Tile Assembly Model (aTAM) [7] and the Two-Handed Tile Assembly Model (2HAM) [4]. Both models constitute a mathematical model of self-assembly in which system components are four-sided Wang tiles with glue types assigned to each tile edge. Any pair of glue types are assigned some nonnegative interaction strengt...
متن کاملEfficient Squares and Turing Universality at Temperature 1 with a Unique Negative Glue
Is Winfree’s abstract Tile Assembly Model (aTAM) “powerful?” Well, if certain tiles are required to “cooperate” in order to be able to bind to a growing tile assembly (a.k.a., temperature 2 self-assembly), then Turing universal computation and the efficient self-assembly of N ×N squares is achievable in the aTAM (Rotemund and Winfree, STOC 2000). So yes, in a computational sense, the aTAM is qu...
متن کاملSelf-Assembly of Squares and Scaled Shapes
The abstract Tile Assembly Model (aTAM) [3] is a mathematical model of self-assembly in which system components are four-sided Wang tiles with glue types assigned to each tile edge. Any pair of glue types are assigned some nonnegative interaction strength denoting how strongly the pair of glues bind. An aTAM system is an ordered triplet .T; ; / consisting of a set of tiles T , a positive intege...
متن کاملUniversal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
We show how to design a universal shape replicator in a selfassembly system with both attractive and repulsive forces. More precisely, we show that there is a universal set of constant-size objects that, when added to any unknown holefree polyomino shape, produces an unbounded number of copies of that shape (plus constant-size garbage objects). The constant-size objects can be easily constructe...
متن کامل